Necessary conditions for subclasses of random context languages
نویسندگان
چکیده
منابع مشابه
The Inclusion Problem for Some Subclasses of Context-Free Languages
− By a reduction to Post’s Correspondence Problem we provide a direct proof of the known fact that the inclusion problem for unambiguous context-free grammars is undecidable. The argument or some straightforward modification also applies to some other subclasses of context-free languages such as linear languages, sequential languages, and DSClanguages (i.e., languages generated by context-free ...
متن کاملTape Bounds for Some Subclasses of Deterministic Context-Free Languages
There are several interesting observations to be made concerning the tape complexity of context-free languages. An early result given by Lewis et al. (1965) is that every context-free language can be recognized by an off-line deterministic Turing machine of O((log n) 2) tape complexity. This is still the best result known. Sudborough (1975) shows that if all linear context-free languages can be...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملAlmost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages
Sublinear time almost optimal algorithms for the recognition problem for three basic sub-classes of context-free languages (unambiguous, deterministic and linear) are presented. Optimality is measured with respect to the work of the best known sequential algorithm for a given problem.
متن کاملRegular splicing languages and subclasses
Recent developments in the theory of finite splicing systems have revealed surprising connections between long-standing notions in the formal language theory and splicing operation. More precisely, the syntactic monoid and Schützenberger constant have strong interaction with the investigation of regular splicing languages. This paper surveys results of structural characterization of classes of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.12.038